Search results for "Binomial coefficient"
showing 7 items of 7 documents
Approximation Operators of Binomial Type
1999
Our objective is to present a unified theory of the approximation operators of binomial type by exploiting the main technique of the so- called “ umbral calculus” or “finite operator calculus” (see [18], [20]-[22]). Let us consider the basic sequence (bn)n≥0 associated to a certain delta operator Q. By supposing that b n (x) ≥ 0, x ∈ [0, ∞), our purpose is to put in evidence some approximation properties of the linear positive operators (L Q n ) n≥1 which are defined on C[0,1] by \( L_n^Qf = \sum\limits_{k = 0}^n {\beta _n^Q{,_k}f\left( {\frac{k}{n}} \right),\beta _{n{,_k}}^Q\left( x \right): = } \frac{1}{{{b_n}\left( n \right)}}\left( {\begin{array}{*{20}{c}} n \\ k \end{array}} \right){b_…
h analogue of Newton's binomial formula
1998
In this letter, the $h$--analogue of Newton's binomial formula is obtained in the $h$--deformed quantum plane which does not have any $q$--analogue. For $h=0$, this is just the usual one as it should be. Furthermore, the binomial coefficients reduce to $\frac{n!}{(n-k)!}$ for $h=1$. \\ Some properties of the $h$--binomial coefficients are also given. \\ Finally, I hope that such results will contribute to an introduction of the $h$--analogue of the well--known functions, $h$--special functions and $h$--deformed analysis.
Generalized Schröder permutations
2013
We give the generating function for the integer sequence enumerating a class of pattern avoiding permutations depending on two parameters: m and p. The avoided patterns are the permutations of length m with the largest element in the first position and the second largest in one of the last p positions. For particular instances of m and p we obtain pattern avoiding classes enumerated by Schroder, Catalan and central binomial coefficient numbers, and thus, the obtained two-parameter generating function gathers under one roof known generating functions and expresses new ones. This work generalizes some earlier results of Barcucci et al. (2000) [2], Kremer (2000) [5] and Kremer (2003) [6].
A loopless algorithm for generating the permutations of a multiset
2003
AbstractMany combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shuffle on trajectories (defined previously in a non-combinatorial context), and we show how this constructor enables us to obtain a new loopless generating algorithm for multiset permutations from similar results for simpler objects.
More restrictive Gray codes for some classes of pattern avoiding permutations
2009
In a recent article [W.M.B. Dukes, M.F. Flanagan, T. Mansour, V. Vajnovszki, Combinatorial Gray codes for classes of pattern avoiding permutations, Theoret. Comput. Sci. 396 (2008) 35-49], Dukes, Flanagan, Mansour and Vajnovszki present Gray codes for several families of pattern avoiding permutations. In their Gray codes two consecutive objects differ in at most four or five positions, which is not optimal. In this paper, we present a unified construction in order to refine their results (or to find other Gray codes). In particular, we obtain more restrictive Gray codes for the two Wilf classes of Catalan permutations of length n; two consecutive objects differ in at most two or three posit…
Combinatorial Gray codes for classes of pattern avoiding permutations
2007
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.
Correspondence between generalized binomial field states and coherent atomic states
2008
We show that the N-photon generalized binomial states of electromagnetic field may be put in a bijective mapping with the coherent atomic states of N two-level atoms. We exploit this correspondence to simply obtain both known and new properties of the N-photon generalized binomial states. In particular, an over-complete basis of these binomial states and an orthonormal basis are obtained. Finally, the squeezing properties of generalized binomial state are analyzed.